منابع مشابه
Recognizing and Drawing IC-Planar Graphs
IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph G with n vertices, we present an O(n)-time algorithm that computes a straight-line drawing of G in quadratic area, and an O(n3)-time algorithm that computes a straight-li...
متن کاملRecognizing IC-Planar and NIC-Planar Graphs
We prove that triangulated IC-planar and NIC-planar graphs can be recognized in cubic time. A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge. A drawing is IC-planar if, in addition, each vertex is incident to at most one crossing edge and NIC-planar if two pairs of crossing edges share at most one vertex. In a triangulated drawing each face is a triangle. I...
متن کاملPlanar Drawing of Clustered Graphs
Graphs are often used to represent relational information. As the amount of information that we want to visualize becomes larger and more complicated, classical graph model tends to be insuucient. In this paper, we introduce and show how to draw a practical and simple graph structure known as clustered graphs. We present an algorithm which produces planar, straight-line, convex drawings of clus...
متن کاملOn Drawing Planar Angle Graphs
Recently, some advanced algorithms for straight line drawings of planar graphs have been introduced. However, these algorithms produce drawings with many small angles. Their drawings are not aesthetically nice. Our goal is to resolve these problems by a beautifier. We consider the angles of planar straight line drawings. In a first phase we compute maximal angles by repeatedly solving a linear ...
متن کاملDrawing HV-Restricted Planar Graphs
A strict orthogonal drawing of a graph G = (V,E) in R is a drawing of G such that each vertex is mapped to a distinct point and each edge is mapped to a horizontal or vertical line segment. A graph G is HV -restricted if each of its edges is assigned a horizontal or vertical orientation. A strict orthogonal drawing of an HV -restricted graph G is good if it is planar and respects the edge orien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.04.026